Families of sets whose pairwise intersections have prescribed cardinals or order type s
نویسنده
چکیده
(i) J. Baumgartner has kindly drawn our attention to the fact that Theorem 2 a s stated in (1) is false . A counter example is the case in which m = N2 ; n = N I ; p = For by reference (3) of the paper (1) there is an almost disjoint family (Ay: y < ail ) of infinite subsets of w . Put A,, = w for ml v < w2 . Then, contrary to the assertion of that theorem, all conditions of Theorem 2 are satisfied . However, Theorem 2 becomes correct if the hypothesis (1) cfm + p + ; m > n; m > p+
منابع مشابه
Transversals and Multitransversals
A transversal of a family .Fof sets is a family of pairwise distinct elements, one from each member of .y , and a multitransversal of .IF is a family of pairwise disjoint subsets, one of each member of F . The main result of this note, Theorem 4, gives necessary and sufficient conditions on families sa/ and .4 of cardinals in order that every family J whose members have cardinals given by sl sh...
متن کاملSome Families of Graphs whose Domination Polynomials are Unimodal
Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=sum_{i=gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $gamma(G)$ is the domination number of $G$. In this paper we present some families of graphs whose domination polynomials are unimodal.
متن کاملAlmost-Fisher families
A classic theorem in combinatorial design theory is Fisher’s inequality, which states that a family F of subsets of [n] with all pairwise intersections of size λ can have at most n non-empty sets. One may weaken the condition by requiring that for every set in F , all but at most k of its pairwise intersections have size λ. We call such families k-almost λ-Fisher. Vu was the first to study the ...
متن کاملA Variant of Helly's Theorem1
1. Helly's [8] theorem on intersections of convex sets ("If every k-\-l members of a family of compact, convex subsets of Ek have a nonempty intersection, then the intersection of all the members of the family is not empty") has been generalized in various directions. Helly himself gave (in [9]) a generalization to families of not necessarily convex sets, in which the intersections of any 2, 3,...
متن کاملThe number of k-intersections of an intersecting family of r-sets
The Erdős-Ko-Rado theorem tells us how large an intersecting family of r-sets from an n-set can be, while results due to Lovász and Tuza give bounds on the number of singletons that can occur as pairwise intersections of sets from such a family. We consider a natural common generalization of these problems. Given an intersecting family of r-sets from an n-set and 1 ≤ k ≤ r, how many k-sets can ...
متن کامل